On Tractability of Disjoint AND-Decomposition of Boolean Formulas
نویسندگان
چکیده
Disjoint AND-decomposition of a boolean formula means its representation as a conjunction of two (or several) formulas having disjoint sets of variables. We show that deciding AND-decomposability is intractable in general for boolean formulas given in CNF or DNF and prove tractability of computing AND-decompositions of boolean formulas given in positive DNF, Full DNF, and ANF. The results follow from tractability of multilinear polynomial factorization over the finite field of order 2, for which we provide a polytime factorization algorithm based on identity testing for partial derivatives of multilinear polynomials.
منابع مشابه
The Complexity of AND-Decomposition of Boolean Formulas
Decomposition of boolean functions is an important research topic having a long history and a wide range of applications in the logic circuit synthesis, (hyper)graph/game theory, and combinatorial optimization. AND-decomposition means representing a boolean function as a conjunction of two (or several) functions sharing a given subset of variables. If the shared subset is empty, the decompositi...
متن کاملReliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملOn Sets with Cardinality Constraints in Satisfiability Modulo Theories
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier-free BAPA (QFBAPA). Deciding the satisfiability of QFBAPA formulas has been shown to be NP-complete using an eager reduction to quantifier-fr...
متن کاملLooking Algebraically at Tractable Quantified Boolean Formulas
We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were ...
متن کاملA Strongly Exponential Separation of DNNFs from CNF Formulas
Decomposable Negation Normal Forms (DNNFs) are a restricted form of Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove an unconditional exponential lower bound on the size of DNNFs for a class of CNF formulas built from expander graphs. This result settles several open problems in the area of knowledge co...
متن کامل